Much work has been done on extending the well-founded semantics to generaldisjunctive logic programs and various approaches have been proposed. However,these semantics are different from each other and no consensus is reached aboutwhich semantics is the most intended. In this paper we look at disjunctivewell-founded reasoning from different angles. We show that there is anintuitive form of the well-founded reasoning in disjunctive logic programmingwhich can be characterized by slightly modifying some exisitng approaches todefining disjunctive well-founded semantics, including program transformations,argumentation, unfounded sets (and resolution-like procedure). We also providea bottom-up procedure for this semantics. The significance of our work is notonly in clarifying the relationship among different approaches, but also shedsome light on what is an intended well-founded semantics for disjunctive logicprograms.
展开▼
